Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5
نویسندگان
چکیده
منابع مشابه
Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5
are considered in this paper. Examples of finite Qn-geometries are constructed for any n i> 2. In particular, we obtain new examples of finite 2-arc-transitive graphs of girth 5, containing Petersen subgraphs (cf. [4], [5] for an enquiry into this class of graphs). Furthermore, we give a complete classification of Q2-geometries using coset enumeration. In particular, we show that they are all f...
متن کاملOn Some Flag-Transitive Extensions of the Dual Petersen Graph
We consider flag-transitive extensions of the dual Petersen graph satisfying one of the following "pathological" properties: (-riLL) there are pairs of collinear points incident to more than one line; ( -TT) there are triples of collinear points not incident to the same plane. We prove that ihere is just one example-satisfying (~LL), with six points and $6 as its au tomorphism group, and there ...
متن کاملA construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ , then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary even girth with 2-arc transitive automorphism groups, showing that there are infinitely many 2...
متن کاملAlmost Covers Of 2-Arc Transitive Graphs
Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the quotient graph of Γ relative to B and Γ [B,C] the bipartite subgraph of Γ induced by adjacent blocks B,C of B. In this paper we study such graphs for which ΓB is connected, (G,2)-arc transitive and is almost covered by Γ in the sense that Γ [B,C] is a matching of v−1≥2 edge...
متن کاملGirth six cubic graphs have Petersen minors
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. 3 January 1997 Revised 17 March 2014 ∗ Research partially performed under a consulting agreement with Bellcore, and partially supported by DIMACS Center, Rutgers University, New Brunswick, New Jersey 08903, USA. 1 Partially supported by NSF under Grant No...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1992
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(05)80034-4